Adaptive insertion policies for high performance caching
نویسندگان
چکیده
منابع مشابه
Adaptive Subset Based Replacement Policy for High Performance Caching
An Adaptive Subset Based Replacement Policy (ASRP) is proposed in this paper. In ASRP policy, each set in Last-Level Cache (LLC) is divided into multiple subsets, and one subset is active and others are inactive at a given time. The victim block for a miss is only chosen from the active subset using LRU policy. A counter in each set records the cache misses in the set during a period of time. W...
متن کاملAdaptive Performance-Aware Distributed Memory Caching
Distributed in-memory caching systems such as memcached have become crucial for improving the performance of web applications. However, memcached by itself does not control which node is responsible for each data object, and inefficient partitioning schemes can easily lead to load imbalances. Further, a statically sized memcached cluster can be insufficient or inefficient when demand rises and ...
متن کاملHigh Performance Dynamic Linking Through Caching
The Spring Operating System provides high performance dynamic linking of program images. Spring uses caching of both fixed-up program images and partially fixed-up shared libraries to make dynamic linking of program images efficient, to reduce the need for PIC (position-independent code), and to improve page sharing between different program images running the same libraries. The result is that...
متن کاملAdvanced Replacement Policies for WWW Caching
WWW caching necessitates advanced replacement policies that include sophisticated control logic and efficient contents management. This paper presents a constructive approach for the design and analysis of such advanced policies. Based on this approach, we develop a new caching policy, namely, PSSW. Trace-driven simulations show PSS-W outperforms most contemporary policies in both hit rates and...
متن کاملApplication-Controlled File Caching Policies
We consider how to improve the performance of le caching by allowing user-level control over le cache replacement decisions. We use two-level cache management: the kernel allocates physical pages to individual applications (allocation), and each application is responsible for deciding how to use its physical pages (replacement). Previous work on two-level memory management has focused on replac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGARCH Computer Architecture News
سال: 2007
ISSN: 0163-5964
DOI: 10.1145/1273440.1250709